An Experimental Evaluation of Algorithms for Vlsi Partitioning
نویسندگان
چکیده
This report describes work in VLSI partitioning done under the Computing Research Association's Computing Research Experience for Women program. Three undergraduate women participated throughout the 1998-1999 academic year. In the process, the team wrote software to implement two existing "classic" methods for VLSI partitioning, and studied modern algorithms by reading recent journal and conference papers. The team then developed, coded and experimented with new algorithms, including a genetic algorithm and algorithm that uses clustering to speed up execution time. A parser for structural circuit descriptions written in the VHDL language was also developed, so that the partitioning algorithms could be evaluated using a wide variety of example circuits.
منابع مشابه
Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملDesign and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
We discuss the implementation and evaluation of move-based hypergraph partitioning heuristics in the context of VLSI design applications. Our rst contribution is a detailed software architecture, consisting of seven reusable components, that allows exible, e cient and accurate assessment of the practical implications of new move-based algorithms and partitioning formulations. Our second contrib...
متن کاملVlsi Circuit Partitioning by Cluster - Removalusing Iterative Improvement
Move-based iterative improvement partitioning methods such as the Fiduccia-Mattheyses (FM) algorithm 3] and Krishnamurthy's Look-Ahead (LA) algorithm 4] are widely used in VLSI CAD applications largely due to their time eeciency and ease of implementation. This class of algorithms is of the \local improvement" type. They generate relatively high quality results for small and medium size circuit...
متن کاملEvolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI has been a hot issue in recent years. In VLSI circuit partitioning, the problem of obtaining a minimum cut is of prime importance. With current trends, partitioning with multiple objectives which includes power, delay...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کامل